Meta-Fibonacci Sequences, Binary Trees and Extremal Compact Codes
نویسندگان
چکیده
We consider a family of meta-Fibonacci sequences which arise in studying the number of leaves at the largest level in certain infinite sequences of binary trees, restricted compositions of an integer, and binary compact codes. For this family of meta-Fibonacci sequences and two families of related sequences we derive ordinary generating functions and recurrence relations. Included in these families of sequences are several well-known sequences in the Online Encyclopedia of Integer Sequences (OEIS).
منابع مشابه
Isoperimetric Sequences for Infinite Complete Binary Trees, Meta-Fibonacci Sequences and Signed Almost Binary Partitions
In this paper we demonstrate connections between three seemingly unrelated concepts. 1. The discrete isoperimetric problem in the infinite binary tree with all the leaves at the same level, T∞: The n-th edge isoperimetric number δ(n) is defined to be min|S|=n,S⊂V (T∞) |(S, S)|, where (S, S) is the set of edges in the cut defined by S. 2. Signed almost binary partitions: This is the special case...
متن کاملThe (non-)existence of perfect codes in Lucas cubes
A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring. Similarly, a Lucas string is a Fibonacci string $b_1b_2ldots b_n$ that $b_1cdot b_n = 0$. For a natural number $ngeq1$, a Fibonacci cube of dimension $n$ is denoted by $Gamma_n$ and i...
متن کاملFibonacci-Like Polynomials Produced by m-ary Huffman Codes for Absolutely Ordered Sequences
A non-decreasing sequence of positive integer weights P ={p1, p2,..., pn} (n = N*(m-1) + 1, N is number of non-leaves of m-ary tree) is called absolutely ordered if the intermediate sequences of weights produced by m-ary Huffman algorithm for initial sequence P on i-th step satisfy the following conditions 2 , , ) ( 1 ) ( − = < + N 0 i p p i m i m . Let T be an m-ary tree of size n and M=M(T) b...
متن کاملTrees and Meta-Fibonacci Sequences
For k > 1 and nonnegative integer parameters ap, bp, p = 1..k, we analyze the solutions to the meta-Fibonacci recursion C(n) = ∑k p=1 C(n − ap − C(n − bp)), where the parameters ap, bp, p = 1..k satisfy a specific constraint. For k = 2 we present compelling empirical evidence that solutions exist only for two particular families of parameters; special cases of the recursions so defined include ...
متن کاملVarn Codes and Generalized Fibonacci Trees
Yarn's [6] algorithm solves the problem of finding an optimal code tree, optimal in the sense of minimum average cost, when the code symbols are of unequal cost and the source symbols are equiprobable. He addresses both exhaustive codes, for which the code tree is a full tree, as well as nonexhaustive codes, but only the exhaustive case will be of concern here. In particular, for code symbol co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 13 شماره
صفحات -
تاریخ انتشار 2006